Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity
نویسنده
چکیده
—We show that for (systematic) linear codes the time complexity of unique decoding is 2/ 2 nRH R O n q and the time complexity of minimum distance decoding is 2 nRH R O n q . The proposed algorithm inspects all error patterns in the information set of the received message of weight less than 2 d or d , respectively.
منابع مشابه
Decoding of Block and Convolutional Codes in Rank Metric DISSERTATION
Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...
متن کاملDecoding of block and convolutional codes in rank metric
R ank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowaday...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملDesign of High-Rate Serially Concatenated Codes with Low Error Floor
In this paper we look at the serial concatenation of short linear block codes with a rate-1 recursive convolutional encoder, with a goal of designing high-rate codes with low error floor. We observe that under turbo-style decoding the error floor of the concatenated codes with extended Hamming codes is due to detectable errors in many cases. An interleaver design addressing this is proposed in ...
متن کاملSimultaneous Partial Inverses and Decoding Interleaved Reed-Solomon Codes
This paper introduces the simultaneous partialinverse problem for polynomials and develops its application to decoding interleaved Reed-Solomon codes and subfield-evaluation codes beyond half the minimum distance. The simultaneous partial-inverse problem has a unique solution (up to a scale factor), which can be computed by an efficient new algorithm, for which we also offer some variations. De...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1003.4627 شماره
صفحات -
تاریخ انتشار 2010